A new color change to improve the coloring of a graphBERGE, C.Discrete applied mathematics. 1989, Vol 24, Num 1-3, pp 25-28, issn 0166-218XArticle

An O(n^1.5) algforithm to color proper circular arcsWEI-KUAN SHIH; WEN-LIAN HSU.Discrete applied mathematics. 1989, Vol 25, Num 3, pp 321-323, issn 0166-218X, 3 p.Article

An extermal coloring problem on matricesGRONAU, H.-D. O. F; LABAHN, R.Discrete mathematics. 1986, Vol 61, Num 2-3, pp 321-324, issn 0012-365XArticle

Minimax relations for the partial q-colorings of a graphBERGE, C.Discrete mathematics. 1989, Vol 74, Num 1-2, pp 3-14, issn 0012-365XArticle

Hook-free colorings and a problem of HansonAIGNER, M; GRIESER, D.Combinatorica (Print). 1988, Vol 8, Num 2, pp 143-148, issn 0209-9683Article

K-Color Sperner theoremsGRIGGS, J. R; MODLYZKO, A. M; SHEARER, J. B et al.Journal of combinatorial theory. Series A. 1986, Vol 42, Num 1, pp 31-54, issn 0097-3165Article

A Δ-subgraph condition for a graph to be class 1CHETWYND, A. G; HILTON, A. J. W.Journal of combinatorial theory. Series B. 1989, Vol 46, Num 1, pp 37-45, issn 0095-8956Article

On σ-polynomialsSHAO-JI XU.Discrete mathematics. 1988, Vol 69, Num 2, pp 189-194, issn 0012-365XArticle

On generalized graph coloringsBROWN, J. I; CORNEIL, D. G.Journal of graph theory. 1987, Vol 11, Num 1, pp 87-99, issn 0364-9024Article

On the chromatic index of multigraphs and a conjoncture of SeymourMARCOTTE, O.Journal of combinatorial theory. Series B. 1986, Vol 41, Num 3, pp 306-331, issn 0095-8956Article

Sur des graphes finis et infinis = On finite and infinite graphsHAHN, Gena; BERMOND, Jean-Claude.1986, 116 pThesis

Two-colourings that decompose perfect graphsCHVATAL, V; LENHART, W. J; SBIHI, N et al.Journal of combinatorial theory. Series B. 1990, Vol 49, Num 1, pp 1-9, issn 0095-8956, 9 p.Article

Maximal anti Ramsey graphs and the strong chromatic numberBURR, S. A; ERDOS, P; GRAHAM, R. L et al.Journal of graph theory. 1989, Vol 13, Num 3, pp 263-282, issn 0364-9024Article

On the greatest number of 2 and 3 colorings of a (V, E) ― graphsLAZEBNIK, F.Journal of graph theory. 1989, Vol 13, Num 2, pp 203-214, issn 0364-9024Article

Lower bounds for small diagonal Ramsey numbersSHEARER, J. B.Journal of combinatorial theory. Series A. 1986, Vol 42, Num 2, pp 302-304, issn 0097-3165Article

The chromaticity of complete bipartite graphs with at most one edge deletedTEO, C. P; KOH, K. M.Journal of graph theory. 1990, Vol 14, Num 1, pp 89-99, issn 0364-9024Article

Fractional total colouringRYAN, J.Discrete applied mathematics. 1990, Vol 27, Num 3, pp 287-292, issn 0166-218X, 6 p.Article

A randomised 3-colouring algorithmPETFORD, A. D; WELSH, D. J. A.Discrete mathematics. 1989, Vol 74, Num 1-2, pp 253-261, issn 0012-365XArticle

Applications of edge coloring of multigraphs to vertex coloring of graphsKIERSTEAD, H. A.Discrete mathematics. 1989, Vol 74, Num 1-2, pp 117-124, issn 0012-365XArticle

Hadwiger's conjecture (k=6): neighbour configurations of 6-vertices in contraction-critical graphsMAYER, J.Discrete mathematics. 1989, Vol 74, Num 1-2, pp 137-148, issn 0012-365XArticle

On the harmonious chromatic number of a graphMITCHEM, J.Discrete mathematics. 1989, Vol 74, Num 1-2, pp 151-157, issn 0012-365XArticle

Sequential coloring versus Welsh-Powell boundSYSŁO, M. M.Discrete mathematics. 1989, Vol 74, Num 1-2, pp 241-243, issn 0012-365XArticle

A question of protocolBOUWER, I; STAR, Z.The American mathematical monthly. 1988, Vol 95, Num 2, pp 118-121, issn 0002-9890Article

On the parameter v₂(h) for L₂-coloured graphsGIONFRIDDO, M; MILICI, S.Discrete mathematics. 1988, Vol 68, Num 1, pp 107-110, issn 0012-365XArticle

Perfectly orderable graphs are quasi-parity graphs: a short proofHERTZ, A; DE WERRA, D.Discrete mathematics. 1988, Vol 68, Num 1, pp 111-113, issn 0012-365XArticle